On Steepest-Descent-Kaczmarz methods for regularizing systems of nonlinear ill-posed equations
نویسندگان
چکیده
We investigate modified steepest descent methods coupled with a loping Kaczmarz strategy for obtaining stable solutions of nonlinear systems of ill-posed operator equations. We show that the proposed method is a convergent regularizationmethod. Numerical tests are presented for a linear problem related to photoacoustic tomography and a non-linear problem related to the testing of semiconductor devices.
منابع مشابه
Kaczmarz Methods for Regularizing Nonlinear Ill-posed Equations I: Convergence Analysis
In this article we develop and analyze novel iterative regularization techniques for the solution of systems of nonlinear ill–posed operator equations. The basic idea consists in considering separately each equation of this system and incorporating a loping strategy. The first technique is a Kaczmarz–type method, equipped with a novel stopping criteria. The second method is obtained using an em...
متن کاملOn Levenberg-marquardt-kaczmarz Iterative Methods for Solving Systems of Nonlinear Ill-posed Equations
In this article a modified Levenberg-Marquardt method coupled with a Kaczmarz strategy for obtaining stable solutions of nonlinear systems of ill-posed operator equations is investigated. We show that the proposed method is a convergent regularization method. Numerical tests are presented for a non-linear inverse doping problem based on a bipolar model.
متن کاملOn Levenberg-Marquardt Kaczmarz regularization methods for ill-posed problems
We investigate modified Levenberg-Marquardt methods coupled with a Kaczmarz strategy for obtaining stable solutions of nonlinear systems of ill-posed operator equations. We show that the proposed method is a convergent regularization method.
متن کاملRegularizing Newton-Kaczmarz Methods for Nonlinear Ill-Posed Problems
We introduce a class of stabilizing Newton-Kaczmarz methods for nonlinear ill-posed problems and analyze their convergence and regularization behaviour. As usual for iterative methods for solving nonlinear ill-posed problems, conditions on the nonlinearity (or the derivatives) have to be imposed in order to obtain convergence. As we shall discuss in general and in some specific examples, the no...
متن کاملFaster gradient descent and the efficient recovery of images
Much recent attention has been devoted to gradient descent algorithms where the steepest descent step size is replaced by a similar one from a previous iteration or gets updated only once every second step, thus forming a faster gradient descent method. For unconstrained convex quadratic optimization these methods can converge much faster than steepest descent. But the context of interest here ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 202 شماره
صفحات -
تاریخ انتشار 2008